home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
InfoMagic Standards 1994 January
/
InfoMagic Standards - January 1994.iso
/
ccitt
/
1988
/
troff
/
10_1_06.tro
< prev
next >
Wrap
Text File
|
1991-12-12
|
51KB
|
3,797 lines
.rs
.\" Troff code generated by TPS Convert from ITU Original Files
.\" Not Copyright ( c) 1991
.\"
.\" Assumes tbl, eqn, MS macros, and lots of luck.
.TA 1c 2c 3c 4c 5c 6c 7c 8c
.ds CH
.ds CF
.EQ
delim @@
.EN
.nr LL 40.5P
.nr ll 40.5P
.nr HM 3P
.nr FM 6P
.nr PO 4P
.nr PD 9p
.po 4P
.rs
\v | 5i'
.ce 1000
ANNEX\ C2
.ce 0
.ce 1000
(to Recommendation Z.100)
.sp 9p
.RT
.ce 0
.ce 1000
\fBSDL PR syntax summary\fR
.sp 1P
.RT
.ce 0
.LP
1
\fIsystem\fR
.sp 1P
.RT
.LP
.rs
.sp 6P
.ad r
\fBFigure T1003240\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
2
\fIdefinition\fR
.sp 9p
.RT
.LP
.rs
.sp 13P
.ad r
\fBFigure T1003250\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
3
\fIdiagram\fR
.sp 9p
.RT
.PP
Diagram is defined in GR syntax summary.
.RT
.sp 1P
.LP
4
\fIsystem definition\fR | (Basic SDL 2.4.1)
.sp 9p
.RT
.LP
.rs
.sp 16P
.ad r
\fBFigure T1003260\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
5
\fIblock definition\fR | (Basic SDL 2.4.2)
.sp 9p
.RT
.LP
.rs
.sp 42P
.ad r
\fBFigure T1003270\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
6
\fItextual block reference\fR | (Basic SDL 2.4.2)
.sp 9p
.RT
.LP
.rs
.sp 2P
.ad r
\fBFigure T1003280\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
7
\fIprocess definition\fR | (Basic SDL 2.4.3)
.sp 9p
.RT
.LP
.rs
.sp 47P
.ad r
\fBFigure T1003290\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.sp 1P
.LP
8
\fItextual process reference\fR | (Basic SDL 2.4.3)
.sp 9p
.RT
.LP
.rs
.sp 2P
.ad r
\fBFigure T1003300\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
9
\fIvalid input signal set\fR
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1003310\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
10
\fIprocess body\fR | (Basic SDL 2.4.3)
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1003320\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
11
\fIsimple expression\fR
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1003330\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
12
\fIprocedure definition\fR | (Basic SDL 2.3.4)
.sp 9p
.RT
.LP
.rs
.sp 27P
.ad r
\fBFigure T1003340\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
13
\fItextual procedure reference\fR | (Basic SDL 2.3.4)
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1003350\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
14
\fIchannel definition\fR | (Basic SDL 2.5.1)
.sp 9p
.RT
.LP
.rs
.sp 18P
.ad r
\fBFigure T1003360\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
15
\fIsignal route definition\fR | (Basic SDL 2.5.2)
.sp 9p
.RT
.LP
.rs
.sp 14P
.ad r
\fBFigure T1003370\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
16
\fIsignal definition\fR | (Basic SDL 2.5.4)
.sp 9p
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigure T1003380\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
17
\fIsignal list definition\fR | (Basic SDL 2.5.5)
.sp 9p
.RT
.LP
.rs
.sp 2P
.ad r
\fBFigure T1003390\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
18
\fIvariable definition\fR | (Basic SDL 2.6.1.1)
.sp 9p
.RT
.LP
.rs
.sp 6P
.ad r
\fBFigure T1003400\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
19
\fIview definition\fR | (Basic SDL 2.6.1.2)
.sp 9p
.RT
.LP
.rs
.sp 5P
.ad r
\fBFigure T1003410\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
20
\fIview expression\fR | (Data 5.5.4.4)
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1003420\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
21
\fIstart\fR | (Basic SDL 2.6.2)
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1003430\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
22
\fIstate\fR | (Basic SDL 2.6.3)
.sp 9p
.RT
.LP
.rs
.sp 27P
.ad r
\fBFigure T1003440\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
23
\fIinput\fR | (Basic SDL 2.6.4)
.sp 9p
.RT
.LP
.rs
.sp 9P
.ad r
\fBFigure T1003450\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
24
\fIsave\fR | (Basic SDL 2.6.5)
.sp 9p
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigureT1003460\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
25
\fItransition\fR | (Basic SDL 2.6.7)
.sp 9p
.RT
.LP
.rs
.sp 36P
.ad r
\fBFigure T1003470\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
26
\fInextstate\fR | (Basic SDL 2.6.7.2.1)
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1003480\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
27
\fIjoin\fR | (Basic SDL 2.6.7.2.2)
.sp 9p
.RT
.LP
.rs
.sp 2P
.ad r
\fBFigure T1003490\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
28
\fIstop\fR | (Basic SDL 2.6.7.2.3)
.sp 9p
.RT
.LP
.rs
.sp 2P
.ad r
\fBFigure T1003500\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
29
\fIreturn\fR | (Basic SDL 2.6.7.2.4)
.sp 9p
.RT
.LP
.rs
.sp 2P
.ad r
\fBFigure T1003510\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
30
\fItask\fR | (Basic SDL 2.7.1)
.sp 9p
.RT
.LP
.rs
.sp 8P
.ad r
\fBFigure T1003520\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
31
\fIcreate request\fR | (Basic SDL 2.7.2)
.sp 9p
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigure T1003530\(hy88 , (N), p.\fR
.ad b
.RT
.sp 1P
.LP
32
\fIprocedure call\fR | (Basic SDL 2.7.3)
.sp 9p
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigure T1003540\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
33
\fIoutput\fR | (Basic SDL 2.7.4)
.sp 9p
.RT
.LP
.rs
.sp 10P
.ad r
\fBFigure T1003550\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
34
\fIdecision\fR | (Basic SDL 2.7.5)
.sp 9p
.RT
.LP
.rs
.sp 17P
.ad r
\fBFigure T1003560\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
35
\fIanswer\fR | (Basic SDL 2.7.5)
.sp 9p
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigure T1003570\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
36
\fItimer definition\fR | (Basic SDL 2.8)
.sp 9p
.RT
.LP
.rs
.sp 5P
.ad r
\fBFigure T1003580\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
37
\fIreset\fR | (Basic SDL 2.8)
.sp 9p
.RT
.LP
.rs
.sp 6P
.ad r
\fBFigure T1003590\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
38
\fIset\fR | (Basic SDL 2.8)
.sp 9p
.RT
.LP
.rs
.sp 6P
.ad r
\fBFigure T1003600\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
39
\fItimer active expression\fR | (Data 5.5.4.5)
.sp 9p
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigure T1003610\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
40
\fIend\fR
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1003620\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
41
\fIsignal list\fR
.sp 9p
.RT
.LP
.rs
.sp 11P
.ad r
\fBFigure T1003630\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
42
\fIsort list\fR
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1003640\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
43
\fIdata definition\fR
.sp 9p
.RT
.LP
.rs
.sp 10P
.ad r
\fBFigure T1003650\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
44
\fIinformal text\fR
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1003660\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
45
\fIactual parameters\fR
.sp 9p
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigure T1003670\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
46
\fIblock substructure definition\fR | (Structural concepts
3.2.2)
.sp 9p
.RT
.LP
.rs
.sp 22P
.ad r
\fBFigure T1003680\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
47
\fIblock substructure reference\fR | (Structural concepts 3.2.2)
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1003690\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
48
\fIchannel connection\fR | (Structural concepts 3.2.2)
.sp 9p
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigure T1003700\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
49
\fIchannel to route connection\fR | (Structural concepts
3.2.2)
.sp 9p
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigure T1003710\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
50
\fIchannel substructure definition\fR | (Structural concepts 3.2.3)
.sp 9p
.RT
.LP
.rs
.sp 11P
.ad r
\fBFigure T1003720\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
51
\fIchannel substructure body\fR | (Structural concepts 3.2.3)
.sp 9p
.RT
.LP
.rs
.sp 17P
.ad r
\fBFigure T1003730\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
52
\fIchannel substructure reference\fR | (Basic SDL 2.5.1)
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1003740\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
53
\fIchannel endpoint connection\fR | (Structural concepts
3.2.3)
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1003750\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
54
\fIsignal refinement\fR | (Structural concepts 3.3)
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1003760\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
55
\fImacro definition\fR | (Additional concepts 4.2.2)
.sp 9p
.RT
.LP
.rs
.sp 22P
.ad r
\fBFigure T1003770\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
56
\fImacro call\fR | (Additional concepts 4.2.3)
.sp 9p
.RT
.LP
.rs
.sp 6P
.ad r
\fBFigure T1003780\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
57
\fIexternal synonym definition\fR | (Additional concepts 4.3.1)
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1003790\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
58
\fIselect definition\fR | (Additional concepts 4.3.3)
.sp 9p
.RT
.LP
.rs
.sp 47P
.ad r
\fBFigure T1003800\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
59
\fItransition option\fR | (Additional concepts 4.3.4)
.sp 9p
.RT
.LP
.rs
.sp 33P
.ad r
\fBFigure T1003810\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.sp 1P
.LP
60
\fIservice decomposition\fR | (Additional concepts 4.10.1)
.sp 9p
.RT
.LP
.rs
.sp 14P
.ad r
\fBFigure T1003820\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.sp 1P
.LP
61
\fIservice definition\fR | (Additional concepts 4.10.2)
.sp 9p
.RT
.LP
.rs
.sp 31P
.ad r
\fBFigure T1003830\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
62
\fIservice reference\fR | (Additional concepts 4.10.1)
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1003840\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
63
\fIsignal route connection\fR | (Additional concepts 4.10.1)
.sp 9p
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigure T1003850\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
64
\fIservice signal definition\fR | (Additional concepts 4.10.1)
.sp 9p
.RT
.LP
.rs
.sp 13P
.ad r
\fBFigure T1003860\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
65
\fIpriority input\fR | (Additional concepts 4.10.2)
.sp 9p
.RT
.LP
.rs
.sp 7P
.ad r
\fBFigure T1003870\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
66
\fIpriority output\fR | (Additional concepts 4.10.2)
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1003880\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
67
\fIcontinuous signal\fR | (Additional concepts 4.11)
.sp 9p
.RT
.LP
.rs
.sp 2P
.ad r
\fBFigure T1003890\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
68
\fIenabling condition\fR | (Additional concepts 4.12)
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1003900\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
69
\fIimport definition\fR | (Additional concepts 4.13)
.sp 9p
.RT
.LP
.rs
.sp 6P
.ad r
\fBFigure T1003910\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
70
\fIimport expression\fR | (Additional concepts 4.13)
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1003920\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
71
\fIexport\fR | (Additional concepts 4.13)
.sp 9p
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigure T1003930\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
72
\fIsort\fR | (Data 5.2.2)
.sp 9p
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigure T1003940\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
73
\fIpartial type definition\fR | (Data 5.2.1)
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1003950\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
74
\fIproperties expression\fR | (Data 5.2.1 and 5.5.3.3)
.sp 9p
.RT
.LP
.rs
.sp 24P
.ad r
\fBFigure T1003960\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
75
\fIoperators\fR | (Data 5.2.2 and 5.4.1.8)
.sp 9p
.RT
.LP
.rs
.sp 5P
.ad r
\fBFigure T1003970\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
76
\fIliteral list\fR | (Data 5.2.2)
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1003980\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
77
\fIliteral signature\fR | (Data 5.2.2 & 5.4.1.8)
.sp 9p
.RT
.LP
.rs
.sp 11P
.ad r
\fBFigure T1003990\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
78
\fIcharacter string literal identifier\fR
.sp 9p
.RT
.LP
.rs
.sp 2P
.ad r
\fBFigure T1004000\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
79
\fIoperator signature\fR | (Data 5.2.2)
.sp 9p
.RT
.LP
.rs
.sp 11P
.ad r
\fBFigure T1004010\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
80
\fIaxioms\fR | (Data 5.2.3 and 5.2.4)
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1004020\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
81
\fIequation\fR
.sp 9p
.RT
.LP
.rs
.sp 37P
.ad r
\fBFigure T1004030\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
82
\fIterm\fR
.sp 9p
.RT
.LP
.rs
.sp 8P
.ad r
\fBFigure T1004040\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
83
\fIground term\fR
.sp 9p
.RT
.LP
.rs
.sp 10P
.ad r
\fBFigure T1004050\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.rs
.sp 8P
.ad r
\fBFigure T1004060\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.rs
.sp 10P
.ad r
\fBFigure T1004070\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.rs
.sp 2P
.ad r
\fBFigure T1004080\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.rs
.sp 6P
.ad r
\fBFigure T1004090\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 6P
.ad r
\fBFigure T1004100\(hy88, (N), p.\fR
.ad b
.RT
.LP
.rs
.sp 10P
.ad r
\fBFigure T1004110\(hy88, (N), p.\fR
.ad b
.RT
.LP
.rs
.sp 2P
.ad r
\fBFigure T1004120\(hy88, (N), p.\fR
.ad b
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1004130\(hy88, (N), p.\fR
.ad b
.RT
.LP
.sp 3
.sp 1P
.LP
84
\fIextended operator identifier\fR
.sp 9p
.RT
.LP
.rs
.sp 6P
.ad r
\fBFigure T1004140\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
85
\fIinfix operator\fR
.sp 9p
.RT
.LP
.rs
.sp 37P
.ad r
\fBFigure T1004150\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
.sp 2
86
\fImonadic operator\fR
.sp 9p
.RT
.LP
.rs
.sp 10P
.ad r
\fBFigure T1004160\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
87
\fIquoted operator\fR
.sp 9p
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigureT1004170\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
88
\fIextended operator name\fR | (Data 5.4.1)
.sp 9p
.RT
.LP
.rs
.sp 8P
.ad r
\fBFigure T1004180\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
89
\fIextended sort\fR | (Data 5.4.1.9)
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1004190\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
90
\fIextended properties\fR | (Data 5.4.1)
.sp 9p
.RT
.LP
.rs
.sp 6P
.ad r
\fBFigure T1004200\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
91
\fIsyntype definition\fR | (Data 5.4.1.9)
.sp 9p
.RT
.LP
.rs
.sp 30P
.ad r
\fBFigure T1004210\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
92
\fIrange conditions\fR | (Data 5.4.1.9.1)
.sp 9p
.RT
.LP
.rs
.sp 12P
.ad r
\fBFigure T1004220\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
93
\fIconstant\fR | (Data 5.4.1.9)
.sp 9p
.RT
.LP
.rs
.sp 19P
.ad r
\fBFigure T1004230\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.sp 1P
.LP
94
\fIstructure definition\fR | (Data 5.4.1.10)
.sp 9p
.RT
.LP
.rs
.sp 19P
.ad r
\fBFigure T1004240\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.sp 1P
.LP
95
\fIinheritance rule\fR | (Data 5.4.1.11)
.sp 9p
.RT
.LP
.rs
.sp 47P
.ad r
\fBFigure T1004250\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.sp 1P
.LP
96
\fIliteral renaming\fR | (Data 5.4.1.11)
.sp 9p
.RT
.LP
.rs
.sp 6P
.ad r
\fBFigure T1004260\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
97
\fIgenerator definition\fR | (Data 5.4.1.12.1)
.sp 9p
.RT
.LP
.rs
.sp 19P
.ad r
\fBFigure T1004270\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
98
\fIgenerator formal name\fR | (Data 5.4.1.12.1)
.sp 9p
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigure T1004280\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
99
\fIgenerator sort\fR | (Data 5.4.1.12.1)
.sp 9p
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigure T1004290\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
100
\fIgenerator instantiations\fR | (Data 5.4.1.12.2)
.sp 9p
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigure T1004300\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
101
\fIgenerator instantiation\fR \
(Data 5.4.1.12.2)
.sp 9p
.RT
.LP
.rs
.sp 9P
.ad r
\fBFigure T1004310\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
102
\fIoperator name\fR
.sp 9p
.RT
.LP
.rs
.sp 16P
.ad r
\fBFigure T1004320\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
103
\fIsynonym definition\fR | (Data 5.4.1.13)
.sp 9p
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigure T1004330\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
104
\fIname class literal\fR | (Data 5.4.1.14)
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1004340\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
105
\fIregular expression\fR | (Data 5.4.1.14)
.sp 9p
.RT
.LP
.rs
.sp 29P
.ad r
\fBFigure T1004350\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
106
\fIground expression\fR | (Data 5.4.2.1)
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1004360\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
107
\fIactive expression\fR | (Data 5.4.2.2)
.sp 9p
.RT
.LP
.rs
.sp 2P
.ad r
\fBFigure T1004370\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
108
\fIground primary\fR | (Data 5.4.2.2)
.sp 9p
.RT
.LP
.rs
.sp 18P
.ad r
\fBFigure T1004380\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
109
\fIfield selection\fR
.sp 9p
.RT
.LP
.rs
.sp 6P
.ad r
\fBFigure T1004390\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
110
\fIoperator identifier\fR
.sp 9p
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigure T1004400\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
111
\fIexpression\fR | (Data 5.5.2.1)
.sp 9p
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigure T1004410\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
112
\fIoperand0\fR | (Data 5.5.2.1)
.sp 9p
.RT
.LP
.rs
.sp 6P
.ad r
\fBFigure T1004420\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
113
\fIoperand1\fR | (Data 5.5.2.1)
.sp 9p
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigure T1004430\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
114
\fIoperand2\fR | (Data 5.5.2.1)
.sp 9p
.RT
.LP
.rs
.sp 13P
.ad r
\fBFigure T1004440\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
115
\fIoperand3\fR | (Data 5.5.2.1)
.sp 9p
.RT
.LP
.rs
.sp 7P
.ad r
\fBFigure T1004450\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
116
\fIoperand4\fR | (Data 5.5.2.1)
.sp 9p
.RT
.LP
.rs
.sp 9P
.ad r
\fBFigure T1004460\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
117
\fIoperand5\fR | (Data 5.5.2.1)
.sp 9p
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigure T1004470\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
118
\fIprimary\fR
.sp 9p
.RT
.LP
.rs
.sp 6P
.ad r
\fBFigure T1004480\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
119
\fIactive primary\fR
.sp 9p
.RT
.LP
.rs
.sp 12P
.ad r
\fBFigure T1004490\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
120
\fIactive expression list\fR | (Data 5.5.2.1)
.sp 9p
.RT
.LP
.rs
.sp 16P
.ad r
\fBFigure T1004500\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 4P
.ad r
\fBFigure T1004510\(hy88, (N), p.\fR
.ad b
.RT
.LP
.rs
.sp 2P
.ad r
\fBFigure T1004520\(hy88, (N), p.\fR
.ad b
.RT
.LP
.rs
.sp 7P
.ad r
\fBFigure T1004530\(hy88, (N), p.\fR
.ad b
.RT
.LP
.rs
.sp 4P
.ad r
\fBFigure T1004540\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
121
\fIassignment statement\fR
.sp 9p
.RT
.LP
.rs
.sp 20P
.ad r
\fBFigure T1004550\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
122
\fIimperative operator\fR | (Data 5.5.4)
.sp 9p
.RT
.LP
.rs
.sp 10P
.ad r
\fB\fR \fBFigure T1004570\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
123
\fInow expression\fR
.sp 9p
.RT
.LP
.rs
.sp 2P
.ad r
\fBFigure T1004580\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
124
\fIPId expression\fR
.sp 9p
.RT
.LP
.rs
.sp 8P
.ad r
\fBFigure T1004590\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
125
\fIliteral\fR
.sp 9p
.RT
.LP
.rs
.sp 5P
.ad r
\fBFigure T1004600\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
126
\fIlabel\fR
.sp 9p
.RT
.LP
.rs
.sp 2P
.ad r
\fBFigure T1004610\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
127
\fIcomment\fR
.sp 9p
.RT
.LP
.rs
.sp 2P
.ad r
\fBFigure T1004620\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
128
\fIidentifier\fR
.sp 9p
.RT
.LP
.rs
.sp 3P
.ad r
\fBFigure T1004630\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
129
\fIqualifier\fR
.sp 9p
.RT
.LP
.rs
.sp 21P
.ad r
\fBFigure T1004640\(hy88, (N), p.\fR
.ad b
.RT
.sp 1P
.LP
130
\fIdecimal integer\fR
.sp 9p
.RT
.LP
.rs
.sp 2P
.ad r
\fBFigure T1004650\(hy88, (N), p.\fR
.ad b
.RT
.sp 2P
.LP
\fBLexical rules syntax diagrams\fR
.sp 1P
.RT
.sp 1P
.LP
131
\fIlexical unit\fR
.sp 9p
.RT
.LP
.rs
.sp 12P
.ad r
\fBFigure T1004660\(hy88, (N), p.\fR
.ad b
.RT
.LP
.bp
.sp 1P
.LP
132
\fIname\fR
.sp 9p
.RT
.LP
.rs
.sp 14P
.ad r
\fBFigure T1004670\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.PP
A \fIname\fR | must contain at least one alphabetic character.
.LP
.sp 5
.sp 1P
.LP
133
\fIend of name\fR
.sp 9p
.RT
.LP
.rs
.sp 11P
.ad r
\fBFigure T1004680\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.sp 1P
.LP
134
\fIalphanumeric\fR
.sp 9p
.RT
.LP
.rs
.sp 13P
.ad r
\fBFigure T1004690\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.sp 1P
.LP
135
\fIletter\fR
.sp 9p
.RT
.LP
.rs
.sp 47P
.ad r
\fBFigure T1004700\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.sp 1P
.LP
136
\fIdecimal digit\fR
.sp 9p
.RT
.LP
.rs
.sp 17P
.ad r
\fBFigure T1004710\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.sp 1P
.LP
137
\fInational\fR
.sp 9p
.RT
.LP
.rs
.sp 21P
.ad r
\fBFigure T1004720\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.sp 1P
.LP
138
\fIcharacter string literal\fR
.sp 9p
.RT
.LP
.rs
.sp 17P
.ad r
\fBFigure T1004730\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.sp 1P
.LP
139
\fIspecial\fR
.sp 9p
.RT
.LP
.rs
.sp 24P
.ad r
\fBFigure T100474600\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.sp 1P
.LP
140
\fIcomposite special\fR
.sp 9p
.RT
.LP
.rs
.sp 25P
.ad r
\fBFigure T1004750\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.sp 1P
.LP
141
\fItext\fR
.sp 9p
.RT
.LP
.rs
.sp 23P
.ad r
\fBFigure T1004760\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.sp 1P
.LP
142
\fInote\fR
.sp 9p
.RT
.LP
.rs
.sp 12P
.ad r
\fBFigure T1004770\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.sp 1P
.LP
143
\fIformal name\fR
.sp 9p
.RT
.LP
.rs
.sp 21P
.ad r
\fBFigure T1004780\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.sp 1P
.LP
144
\fIkeyword\fR
.sp 9p
.RT
.LP
.rs
.sp 47P
.ad r
\fBFigure T1004790\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 47P
.ad r
\fBFigure T1004800\(hy88, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.sp 1P
.ce 1000
INDEX
\v'2p'
.ce 0
.sp 1P
.LP
107
active expression
.sp 9p
.RT
.LP
120
active expression list
.LP
119
active primary
.LP
\ 45
actual parameters
.LP
134
alphanumeric
.LP
\ 35
answer
.LP
121
assignment statement
.LP
\ 80
axioms
.LP
\ \ 5
block definition
.LP
\ 46
block substructure definition
.LP
\ 47
block substructure reference
.LP
\ 48
channel connection
.LP
\ 14
channel definition
.LP
\ 53
channel endpoint connection
.LP
\ 51
channel substructure body
.LP
\ 50
channel substructure definition
.LP
\ 52
channel substructure reference
.LP
\ 49
channel to route connection
.LP
138
character string literal
.LP
\ 78
character string literal identifier
.LP
127
comment
.LP
140
composite special
.LP
\ 93
constant
.LP
\ 67
continuous signal
.LP
\ 31
create request
.LP
\ 43
data definition
.LP
136
decimal digit
.LP
130
decimal integer
.LP
\ 34
decision
.LP
\ \ 2
definition
.LP
\ \ 3
diagram
.LP
\ 68
enabling condition
.LP
\ 40
end
.LP
133
end of name
.LP
\ 81
equation
.LP
\ 71
export
.LP
111
expression
.LP
\ 84
extended operator identifier
.LP
\ 88
extended operator name
.LP
\ 90
extended properties
.LP
\ 89
extended sort
.LP
\ 57
external synonym definition
.LP
109
field selection
.LP
143
formal name
.LP
\ 97
generator definition
.LP
\ 98
generator formal name
.LP
101
generator instantiation
.LP
100
generator instantiations
.LP
\ 99
generator sort
.LP
106
ground expression
.LP
108
ground primary
.LP
\ 83
ground term
.LP
128
identifier
.LP
122
imperative operator
.LP
\ 69
import definition
.LP
\ 70
import expression
.bp
.LP
\ 85
infix operator
.LP
\ 44
informal text
.LP
\ 95
inheritance rule
.LP
\ 23
input
.LP
\ 27
join
.LP
144
keyword
.LP
126
label
.LP
135
letter
.LP
131
lexical unit
.LP
125
literal
.LP
\ 76
literal list
.LP
\ 96
literal renaming
.LP
\ 77
literal signature
.LP
\ 56
macro call
.LP
\ 55
macro definition
.LP
\ 86
monadic operator
.LP
132
name
.LP
104
name class literal
.LP
137
national
.LP
\ 26
nextstate
.LP
142
note
.LP
123
now expression
.LP
112
operand0
.LP
113
operand1
.LP
114
operand2
.LP
115
operand3
.LP
116
operand4
.LP
117
operand5
.LP
110
operator identifier
.LP
102
operator name
.LP
\ 79
operator signature
.LP
\ 75
operators
.LP
\ 33
output
.LP
\ 73
partial type definition
.LP
124
PId expression
.LP
118
primary
.LP
\ 65
priority input
.LP
\ 66
priority output
.LP
\ 32
procedure call
.LP
\ 12
procedure definition
.LP
\ 10
process body
.LP
\ \ 7
process definition
.LP
\ 74
properties expression
.LP
129
qualifier
.LP
\ 87
quoted operator
.LP
\ 92
range conditions
.LP
105
regular expression
.LP
\ 37
reset
.LP
\ 29
return
.LP
\ 24
save
.LP
\ 58
select definition
.LP
\ 60
service decomposition
.LP
\ 61
service definition
.LP
\ 62
service reference
.LP
\ 64
service signal route definition
.LP
\ 38
set
.bp
.LP
\ 16
signal definition
.LP
\ 41
signal list
.LP
\ 17
signal list definition
.LP
\ 54
signal refinement
.LP
\ 63
signal route connection
.LP
\ 15
signal route definition
.LP
\ 11
simple expression
.LP
\ 72
sort
.LP
\ 42
sort list
.LP
139
special
.LP
\ 21
start
.LP
\ 22
state
.LP
\ 28
stop
.LP
\ 94
structure definition
.LP
\ 91
syntype definition
.LP
103
synonym definition
.LP
\ \ 1
system
.LP
\ \ 4
system definition
.LP
\ 30
task
.LP
\ 82
term
.LP
141
text
.LP
\ \ 6
textual block reference
.LP
\ 13
textual procedure reference
.LP
\ \ 8
textual process reference
.LP
\ 39
timer active expression
.LP
\ 36
timer definition
.LP
\ 25
transition
.LP
\ 59
transition option
.LP
\ \ 9
valid input signal set
.LP
\ 18
variable definition
.LP
\ 19
view definition
.LP
\ 20
view expression
.LP
Fin premi\*`ere partie
.LP
.sp 2
.LP
39
ACTIVE
.LP
94,\ 95,\ 100
ADDING
.LP
74,\ 81,\ 95
ALL
.LP
59
ALTERNATIVE
.LP
48,\ 49,\ 53,\ 63,\ 85,\ 113
AND
.LP
74
AXIOMS
.LP
5,\ 6,\ 129
BLOCK
.LP
32
CALL
.LP
14
CHANNEL
.LP
127
COMMENT
.LP
48,\ 49,\ 53,\ 63
CONNECT
.LP
97
CONSTANT
.LP
91
CONSTANTS
.LP
31
CREATE
.LP
18
DCL
.LP
34
DECISION
.LP
74,\ 91
DEFAULT
.LP
34,\ 59,\ 83,\ 108,\ 120
ELSE
.LP
59
ENDALTERNATIVE
.LP
5
ENDBLOCK
.LP
14
ENDCHANNEL
.LP
34
ENDDECISION
.LP
97
ENDGENERATOR
.LP
55
ENDMACRO
.LP
73,\ 91
ENDNEWTYPE
.LP
12
ENDPROCEDURE
.LP
7
ENDPROCESS
.LP
54
ENDREFINEMENT
.LP
58
ENDSELECT
.LP
61
ENDSERVICE
.LP
22
ENDSTATE
.LP
46,\ 50
ENDSUBSTRUCTURE
.LP
91
ENDSYNTYPE
.LP
4
ENDSYSTEM
.LP
14,\ 15,\ 53,\ 64
ENV
.LP
82
ERROR
.LP
71
EXPORT
.LP
18
EXPORTED
.LP
57
EXTERNAL
.bp
.LP
83,\ 108,\ 120
FI
.LP
74,\ 81
FOR
.LP
7,\ 55
FPAR
.LP
14,\ 15,\ 64
FROM
.LP
97
GENERATOR
.LP
58,\ 83,\ 108,\ 120
IF
.LP
70
IMPORT
.LP
69
IMPORTED
.LP
12,\ 74,\ 81,\ 85,\ 114
IN
.LP
95
INHERITS
.LP
23,\ 65
INPUT
.LP
27
JOIN
.LP
97
LITERAL
.LP
74,\ 76,\ 96
LITERALS
.LP
56
MACRO
.LP
55
MACRODEFINITION
.LP
143
MACROID
.LP
74
MAP
.LP
85,\ 116
MOD
.LP
104
NAMECLASS
.LP
73,\ 91
NEWTYPE
.LP
26
NEXTSTATE
.LP
86,\ 117
NOT
.LP
123
NOW
.LP
124
OFFSPRING
.LP
97
OPERATOR
.LP
75,\ 95
OPERATORS
.LP
85,\ 105,\ 112
OR
.LP
75
ORDERING
.LP
12
OUT
.LP
33,\ 66
OUTPUT
.LP
124
PARENT
.LP
65,\ 66,\ 67
PRIORITY
.LP
12,\ 13,\ 129
PROCEDURE
.LP
7,\ 8,\ 129
PROCESS
.LP
67,\ 68
PROVIDED
.LP
6,\ 8,\ 13,\ 47,\ 52,\ 62
REFERENCED
.LP
54
REFINEMENT
.LP
85,\ 116
REM
.bp
.LP
37
RESET
.LP
29
RETURN
.LP
18
REVEALED
.LP
54
REVERSE
.LP
24
SAVE
.LP
58
SELECT
.LP
124
SELF
.LP
124
SENDER
.LP
61,\ 62,\ 129
SERVICE
.LP
38
SET
.LP
16,\ 129
SIGNAL
.LP
17
SIGNALLIST
.LP
15,\ 64
SIGNALROUTE
.LP
9
SIGNALSET
.LP
82
SPELLING
.LP
21
START
.LP
.rs
.sp 35P
.LP
.bp
.LP
22
STATE
.LP
28
STOP
.LP
94
STRUCT
.LP
46,\ 47,\ 50,\ 52,\ 129
SUBSTRUCTURE
.LP
57,\ 103
SYNONYM
.LP
91
SYNTYPE
.LP
4,\ 129
SYSTEM
.LP
30
TASK
.LP
83,\ 108,\ 120
THEN
.LP
97,\ 129
TYPE
.LP
36
TIMER
.LP
14,\ 15,\ 33,\ 64
TO
.LP
33
VIA
.LP
20,\ 33
VIEW
.LP
19
VIEWED
.LP
14,\ 15,\ 64
WITH
.LP
85,\ 112
XOR
.LP
.rs
.sp 35P
.LP
.bp
.ce 1000
ANNEX E
.ce 0
.ce 1000
(to Recommendation Z.100)
.EF '% Fascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ E''
.OF '''Fascicle\ X.1\ \(em\ Rec.\ Z.100\ \(em\ Annex\ E %'
.sp 9p
.RT
.ce 0
.ce 1000
\fBState\(hyoriented representation and pictorial elements\fR
.sp 1P
.RT
.ce 0
.LP
E.1
\fIIntroduction\fR
.sp 1P
.RT
.PP
SDL is based on an \*Qextended\*U Finite State Machine (FSM) model.
That is, an FSM is extended with objects, such as variables, resources,
etc. A machine stays in some state. On receiving a signal, a machine executes
a
transition, in which relevant actions (e.g.\ resource allocation and/or
deallocation, resource control, signal sending, decision, etc.) are taken.
Therefore, the dynamic behaviour of an extended FSM can be explained by
describing action sequences on objects for each transition of the FSM in a
procedural way.
.PP
As a consequence of the state transition, the machine arrives in a new
state. The state of an extended FSM can be characterized by objects associated
with the state, additional object information (e.g.\ the value of variables,
states of resources, relations between the resources), and signals which
can be received in that state. For example, the \*Qawait\(hyfirst\(hydigit
state\*U in telephone call processing is characterized as follows:
.RT
.LP
Caller:
handset\(hyoff
.LP
Dial\ tone\(hysender:
dialtone sending
.LP
Digit\ receiver:
ready for receiving
.LP
Timer:
supervising permanent\(hysignal timing
.LP
Path:
Caller is connected to dial tone\(hysender and
digit receiver,\ etc.
.PP
As can be seen, each state can be defined statically by objects
and additional information (qualifying text) associated with that state.
.PP
The SDL/GR is extended with \fBpictorial elements\fR to define objects
associated with each state. The state definitions in terms of pictorial
elements are called \fBstate pictures\fR . The SDL/GR state symbol may
include a
state picture. This is an optional part of SDL/GR. Figure\ E\(hy1 shows a state
definition example of the \*Qawait\(hyfirst\(hydigit state\*U.
.RT
.LP
.rs
.sp 10P
.ad r
\fBFigure E\(hy1, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.PP
In many cases, actions on each object, which are required in the transition,
can be derived from the difference between state definitions before and
after the transition. For example, if some resource appears only after
transition, it means that resource allocation action is necessary in the
transition. Therefore, if detailed state definitions are given, total actions
in the extended FSM transition can usually be derived from the difference
between pre\(hyand post\(hystate definitions. However, the sequence of
actions in the transition may not be derived from the state definition
difference. Therefore, in SDL diagrams, when the sequence of actions is
less important, those
transition actions which can be derived from the state definition need
not be described explicitly. Otherwise, it is desirable to describe action
sequences explicitly.
.PP
An SDL diagram, in which transitions are described exclusively by
explicit action symbols, is called a
\fBtransition\(hyoriented version of SDL/GR\fR .
.PP
An SDL/GR diagram, in which states are described using state pictures and
transition actions are minimized, is called the \fBstate\(hyoriented version
of SDL/GR\fR or \fBstate\(hyoriented SDL with pictorial elements (SDL/PE).\fR
State pictures can be used advantageously when applied to certain system
definitions, resulting in more compact, declarative and less verbal
process diagrams.
.bp
.PP
A combined version is also possible. Thus, these are\ 3\ SDL/GR
versions:
.RT
.LP
a)
Transition\(hyoriented version
.LP
\(em
Transition sequences are described exclusively by
explicit action symbols.
.LP
\(em
This is, as it were, a procedural explanation of the
extended FSM.
.LP
\(em
This version is suitable when the sequence of actions is important and
detailed state descriptions are not important.
.bp
.LP
b)
State\(hyoriented version
.LP
\(em
The state is described uniquely using pictorial
elements. This picture is called a state picture.
.LP
\(em
The transition action sequence is implied by the
difference between pre\(hyand post\(hystate definitions.
.LP
\(em
This is, as it were, a declarative specification of the extended FSM.
.LP
\(em
This vesion is suitable when the sequence of actions
within each transition is of low importance, when pictorial explanation is
desirable, or when a compact representation is desirable.
.LP
c)
Combined version
.LP
\(em
The combined version is suitable when both the sequence of actions within
each transition and the detailed state descriptions are under consideration.
.PP
Examples of these three versions are given in Figure\ E\(hy2, E\(hy3
and\ E\(hy4.
.LP
.rs
.sp 37P
.ad r
\fBFigure E\(hy2, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 47P
.ad r
\fBFigure E\(hy3, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 47P
.ad r
\fBFigure E\(hy4, (N), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.sp 2P
.LP
E.2
\fIPictorial elements in SDL/GR\fR
.sp 1P
.RT
.PP
The syntax and semantics defined in Recommendation\ Z.100 SDL
applies to pictorial elements. However, these semantics and syntax are
extended as follows:
.PP
Pictorial elements represent various objects. The repertoire of
pictorial elements is in principle unlimited because new pictorial elements
can be invented to suit any new application of the SDL. However, in applications
to telecommunications switching and signalling functions, the following
repertoire of pictorial elements has been found to have considerable
versatility:
.RT
.LP
\(em
functional block boundary (left or right),
.LP
\(em
terminal equipment (various),
.LP
\(em
signalling receiver,
.LP
\(em
signalling sender,
.LP
\(em
combined signalling sender and receiver,
.LP
\(em
supervising timer,
.LP
\(em
switching path (connected, reserved),
.LP
\(em
switching modules,
.LP
\(em
charging in progress,
.LP
\(em
control elements,
.LP
\(em
uncertainty symbol.
.PP
Standard symbols for these pictorial elements are recommended in section\
E.2.2.
.sp 1P
.LP
E.2.1
\fIRules of interpretation\fR
.sp 9p
.RT
.LP
1)
A state symbol may include a \fBstate picture\fR . A state
picture defines de state using pictorial elements and qualifying text.
.LP
2)
Each pictorial element in a state picture represents an
object associated with the state, such as:
.LP
\(em
resources,
.LP
\(em
variables,
.LP
\(em
internal and external boundaries,
.LP
\(em
the relations between objects,
.LP
\(em
signals which can be received in that state,
.LP
\(em
etc.
.LP
3)
Each pictorial element may have accompanying \fBqualifying
text\fR . Qualifying text can be used to explain:
.LP
\(em
detailed resource name,
.LP
\(em
the resource state,
.LP
\(em
value for a variable,
.LP
\(em
signals relevant to the object,
.LP
\(em
etc.
.LP
4)
Function block boundary:
.LP
a)
A \fBfunction block boundary\fR is used to express whether a pictorial
element is \*Qinternal\*U or \*Qexternal\*U to the process. An internal
pictorial element represents objects which are owned by the process. An
external pictorial element represents objects which are owned by another
process under consideration.
.LP
b)
Rule a) also applies to the distinction between
internal and external qualifying text, by substituting the term \*Qqualifying
text\*U for pictorial elements in the rule.
.LP
5)
Transition interpretation rule:
.LP
The total processing involved when a process goes from one state to the
following state is the combination of:
.LP
\(em
The processing to effect changes to all relevant
objects which are derived from the state definition difference.
.LP
\(em
The processing explicitly described in the transition, e.g. outputs or tasks.
.bp
.LP
Thus:
.LP
a)
The absence from one state if a pictorial element
which represents a resource with its presence in the next state implies the
allocation of the resource in all transitions joining the two states. This
can be equivalently represented by a task(s) showing allocation of the
resource in transition(s).
.LP
b)
If \*Qpresence\*U and \*Qabsence\*U are interchanged in
rule\ a), then \*Qallocation\*U is replaced by \*Qdeallocation\*U.
.LP
c)
In rule\ a) if \*Qpictorial element\*U is replaced by
\*Qexternal pictorial element\*U then the task should be replaced by an output
signal requesting the process which owns the resource to allocate it or
simply an input signal from that process saying that it has been allocated.
.LP
d)
If in rule\ a) \*Qpresence\*U and \*Qabsence\*U are
interchanged and also \*Qpictorial element\*U is replaced by \*Qexternal
pictorial
element\*U then follow rule\ c) with \*Qallocate\*U replaced with
\*Qdeallocate\*U.
.LP
e)
Rules\ a), b), c) and d) also apply to the appearance or disappearance
in the state picture of qualifying text, by substituting the term \*Qqualifying
text\*U for pictorial elements in those rules.
.LP
6)
For a given process diagram, particular pictorial elements (or a particular
combination of pictorial elements and qualifying text) should always be
placed in the same position within the state picture whenever they
appear, so that the presence or absence of this pictorial element (or
combination) in a state symbol can be quickly determined by comparing the
state picture with other state pictures in the process diagram.
.LP
7)
When a signal sender appears in a state picture, its
qualifying text identifies a signal which is sent during the following
transitions.
.LP
8)
When a sender of a permanent signal (e.g. a ringtone)
appears in a state picture, its qualifying text identifies a signal which
has been started to be sent during the following transition and in this
state.
.LP
9)
Such transition actions that cannot be derived from the
difference of pre\(hy and post\(hystate definitions should be explicitly
described in the transition. For example, if a resource with an exported
variable does not appear in the pre\(hy and post\(hystates, the necessary
actions are better to be
described in the transition.
.sp 1P
.LP
E.2.2
\fIRecommended symbols for pictorial elements\fR
.sp 9p
.RT
.PP
When using pictorial elements, each state is represented by a state symbol
containing a state picture with the format shown in Figure\ E\(hy5:
.RT
.LP
.rs
.sp 15P
.ad r
\fBFigure E\(hy5, (MC), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.PP
A basic set of pictorial elements is recommended for use in SDL/GR with
application to the system description of telecommunications call handling
processes, including signalling protocols, network services and signalling
interworking processes. Many of these pictorial elements are capable
of being applied in applications of SDL/GR to other than call handling
processes.
.PP
The recommended symbols for the basic set of pictorial elements is
shown in Figure\ E\(hy6, and the recommended proprotions for pictorial element
symbols are shown in Figure\ E\(hy7.
.PP
Examples of the use of the basic set of pictorial elements are shown in
Figure\ E\(hy8.
.RT
.sp 1P
.LP
E.2.3
\fISpecial conventions and interpretations used in the state\fR
\fIoriented extension of SDL/GR\fR
.sp 9p
.RT
.PP
A number of special conventions and interpretations have been
defined in this section with regard to the state\(hyoriented version of SDL/GR.
These includes:
.RT
.LP
\(em
The special interpretation required for process diagrams
according to the so\(hycalled TRANSITION INTERPRETATION RULE (see \(sc\ E.2.1,
rule\ 5).
.LP
\(em
The unique position of pictorial elements (or pictorial
elements and qualifying text) within a state picture that is required when
using pictorial elements (see \(sc\ E.2.1, rule\ 6).
.LP
\(em
The special interpretation required for the variables
represented by external pictorial elements and external qualifying text, as
proxy variables associated with other processes.
.sp 2P
.LP
E.3
\fISelection criteria for pictorial elements\fR
.sp 1P
.RT
.PP
The choice of symbols for pictorial elements has been based upon
the following considerations and general selection criteria. These should be
consulted before developing additional pictorial element symbols for wider
applications of the SDL.
.RT
.LP
1)
Ease of reproduction
.LP
In order to permit convenient reproduction of SDL diagrams using the
dye\(hyline or blue\(hyprint methods of reproduction as well as
photocopying and photo\(hyprinting, pictorial element symbols should consist of
clear lines without shading or coloration.
.LP
2)
Ease of comprehension
.LP
a)
Appropriateness \(em The shape of each symbol should be appropriate to
the concept that the symbol represents.
.LP
b)
Distinctiveness \(em When choosing a basic set of
symbols, care should be taken to permit each symbol to be readily
distinguishable from others in the set.
.LP
c)
Affinity \(em The shapes of pictorial elements
representing different but related functions, e.g.\ receivers and senders,
should be related in some obvious way.
.LP
d)
Association of abbreviated qualifying text with
symbols \(em In some cases it is expected that abbreviated text will be
associated with a pictorial element in order to indicate the class of pictorial
element; e.g.\ the letters MFC associated with a receiver symbol to indicate
that
multi\(hyfrequency coded signals are to be received. In these cases, the
pictorial elements should incorporate enclosed space to permit the use
of a very small
number of alphanumerical characters.
.LP
e)
Limited set \(em The total number of symbols should be
kept to a minimum in order to permit easy learning of the pictorial
method.
.bp
.LP
.rs
.sp 47P
.ad r
\fBFigure E\(hy6, (MC), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 47P
.ad r
\fBFigure E\(hy7, (MC), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 47P
.ad r
\fBFigure E\(hy8, (MC), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 47P
.ad r
\fBFigure E\(hy8 (suite), (MC), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 47P
.ad r
\fBFigure E\(hy8 (suite), (MC), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.LP
.rs
.sp 47P
.ad r
\fBFigure E\(hy8 (fin), (MC), p.\fR
.sp 1P
.RT
.ad b
.RT
.LP
.bp
.sp 2P
.LP
\fBRecommendation\ Z.110\fR
.RT
.sp 2P
.ce 1000
\fBCRITERIA\ FOR\ THE\ USE\ AND\ APPLICABILITY\fR
.EF '% Fascicle\ X.1\ \(em\ Rec.\ Z.110''
.OF '''Fascicle\ X.1\ \(em\ Rec.\ Z.110 %'
.ce 0
.sp 1P
.ce 1000
\fBOF\ FORMAL\ DESCRIPTION\ TECHNIQUES\fR
.FS
The content of this
Recommendation is also published as ISO Resolution\ ISO/IEC\ JTC\ 1/N\ 145.
The statement on precedence in case of several descriptions contained in
the JTC\ 1 document is omitted in this Recommendation.
.FE
.ce 0
.sp 1P
.LP
\fB1\fR \fBSupport for \fR \fBformal description techniques (FDTs)\fR
.sp 1P
.RT
.PP
In view of the complexity and widespread use of Recommendations it is imperative
that advanced methods for the development and implementation of these Recommendations
be used.
.PP
Formal description techniques provide an important approach toward
such advanced methods.
.PP
In some areas, the use of FDTs is still relatively new and phased
procedures are required to introduce their use. This Recommendation proposes
the procedures to accomplish this task.
.RT
.sp 2P
.LP
\fB2\fR \fBFDTs\fR
.sp 1P
.RT
.sp 1P
.LP
2.1
\fIDefinitions\fR
.sp 9p
.RT
.PP
A \fBformal description technique (FDT)\fR is a specification method based
on a description language using rigorous and unambiguous rules both with
respect to developing expressions in the language (formal syntax) and
interpreting the meaning of these expressions (formal semantics). FDTs are
intended to be used in the development, specification, implementation and
verification of Recommendations (or parts thereof).
.PP
A \fBnatural language description\fR is an example of an informal
description technique using one of the languages used by CCITT to publish
Recommendations. It may be supplemented with mathematical and other accepted
notation, figures,\ etc.
.RT
.sp 1P
.LP
2.2
\fIObjectives of an FDT\fR
.sp 9p
.RT
.PP
The goal of an FDT is to permit precise and unambiguous
specifications. FDTs are also intended to satisfy objectives such
as:
.RT
.LP
\(em
a basis for analyzing specifications for correctness,
efficiency,\ etc.;
.LP
\(em
a basis for determining completeness of specifications;
.LP
\(em
a basis for verification of specifications against the
requirement of the Recommendation;
.LP
\(em
a basis for determining conformance of implementations to
Recommendations;
.LP
\(em
a basis for determining consistency of specifications between Recommendations;
.LP
\(em
a basis for implementation support.
.PP
In the current state of the art, in some areas more than one FDT may be
needed to accomplish all objectives.
.sp 1P
.LP
2.3
\fIBenefits of an FDT\fR
.sp 9p
.RT
.PP
The application of an FDT can provide benefits such
as:
.RT
.LP
\(em
improving the quality of Recommendations, which in turn
reduces maintenance costs to both CCITT and to users of Recommendations;
.LP
\(em
reducing dependency on the natural language to communicate
technical concepts in a multilingual environment;
.LP
\(em
reducing development time of implementations by using tools that are
based on the properties of the FDT;
.LP
\(em
making the implementation easier, resulting in better
products.
.bp
.sp 1P
.LP
2.4
\fIProblem with FDTs\fR
.sp 9p
.RT
.PP
FDTs are advanced techniques which have not yet been widely
introduced. In addition, there is a lack of resources in the development of
FDTs
and formal descriptions (FDs), as well as a lack of expertise within the
CCITT Study Groups both to assess the technical merits of the formally
described
Recommendations and to reach consensus on them.
.RT
.sp 1P
.LP
2.5
\fISolutions\fR
.sp 9p
.RT
.PP
The development of tutorial and educational materials will help to provide
widespread understanding of the complexities of FDTs. Nevertheless,
time must be permitted for their assimilation.
.RT
.sp 2P
.LP
\fB3\fR \fBDevelopment and standardization of FDTs\fR
.sp 1P
.RT
.PP
It is important to avoid unnecessary proliferation of FDTs. The
following criteria should be met before adopting a new FDTs:
.RT
.LP
\(em
the need for the FDT should be demonstrated;
.LP
\(em
evidence that it is based on a significantly different model from that
of an existing FDT should be provided, and
.LP
\(em
the usefulness and capabilities of the FDT should be
demonstrated.
.sp 2P
.LP
\fB4\fR \fBDevelopment and acceptance of formal descriptions\fR
.sp 1P
.RT
.PP
4.1
In future, only standard FDTs or FDTs in the process of being standardized
should be used in formal descriptions of Recommendations.
.sp 9p
.RT
.PP
4.2
It is considered that the development of a FD of any particular Recommendation
is a decision of the Study Group (in consultation with ISO for collaborative
standards). If a FD is to be developed for a new Recommendation, the FD
should be progressed, as far as possible, according to the same
timetable as the rest of the Recommendation.
.sp 9p
.RT
.PP
4.3
For the evolutionary introduction of FDs into Recommendations three phases
can be identified. It is the responsibility of the Study Group to decide
which phase initially applies to each FD and the possible evolution of
the FD toward another phase. It is not mandatory for a FD to go through
the
three phases described below and, more generally, it is not mandatory for
a FD to evolve.
.sp 9p
.RT
.sp 1P
.LP
\fIPhase 1\fR
.sp 9p
.RT
.PP
This phase is characterized by the fact that widespread knowledge of FDTs,
and experience in formal descriptions, are lacking; there may not be sufficient
resources in the Study Groups to produce or review formal
descriptions.
.PP
The development of Recommendations has to be based on conventional
natural language approaches, leading to Recommendations where the natural
language description is the definitive Recommendation.
.PP
Study Groups are encouraged to develop FDs of their Recommendations
since these efforts may contribute to the quality of the Recommendations by
detecting defects, may provide additional understanding to readers, and will
support the evolutionary introduction of FDTs.
.PP
A formal description produced by a Study Group that can be considered to
represent faithfully a significant part of the Recommendation or the
complete Recommendation should be published as an appendix to the
Recommendation.
.PP
Meanwhile Study Groups should develop and provide educational material
for the FDTs to support their widespread introduction in the CCITT and
Liaison Organizations.
.bp
.RT
.sp 1P
.LP
\fIPhase 2\fR
.sp 9p
.RT
.PP
This phase is characterized by the fact that knowledge of FDTs and experience
in formal descriptions is more widely available; Study Groups can
provide enough resources to support the production of formal descriptions.
However, it cannot be assured that enough CCITT Members can review formal
descriptions in order to enable them to approve a proposed formally described
Recommendation.
.PP
The development of Recommendations should still be based on
conventional natural language approaches, leading to Recommendation where
the natural language description is the definitive standard. However, these
developments should be accompanied and supported by the development of
formal descriptions of these standards with the objective of improving
and supporting the structure, consistency, and correctness of the natural
language
description.
.PP
A formal description, produced by Study Group, that is considered to represent
faithfully a significant part of the Recommendation or the complete Recommendation
should be published as an annex to the Recommendation.
.PP
Meanwhile educational work should continue.
.RT
.sp 1P
.LP
\fIPhase 3\fR
.sp 9p
.RT
.PP
This phase is characterized by the fact that a widespread knowledge of
FDTs may be assumed; CCITT Members can provide sufficient resources both
to produce and review formal descriptions, and assurance exists that the
application of FDTs does not unnecessarily restrict freedom of the
implementations.
.PP
Study Groups should use FDTs routinely to develop their
Recommendations, and the FD(s) become part of the Recommendation together
with natural language descriptions.
.PP
Whenever a dicrepancy between a natural language description and a
formal description, or between two formal descriptions, is detected, the
discrepancy should be resolved by changing or improving the natural language
description or the FDs without necessarily giving preference to one over the
other(s).
.RT
.PP
4.4
The above procedures for phased development of FDs are intended to aid
the progression of FDs within the standards process, not to hinder their
progression. However, since there has been little or no actual experience
with these procedures, any Study Group having to use them is urged to identify
one or more pilot cases and carefully monitor the progress of each within
the
framework of the procedures. Should procedural problems arise, the Study
Group responsible for Formal Description Techniques should be informed
and, where
possible, recommended procedural modifications should be proposed to alleviate
the problems.
.sp 9p
.RT
.LP
.rs
.sp 22P
.LP
.bp